A trust region interior point algorithm for infinite dimensional nonlinear programming
نویسندگان
چکیده
منابع مشابه
Trust{region Interior{point Algorithms for a Class of Nonlinear Programming Problems Trust{region Interior{point Algorithms for a Class of Nonlinear Programming Problems
Trust{Region Interior{Point Algorithms for a Class of Nonlinear Programming Problems by Lu s Nunes Vicente This thesis introduces and analyzes a family of trust{region interior{point (TRIP) reduced sequential quadratic programming (SQP) algorithms for the solution of minimization problems with nonlinear equality constraints and simple bounds on some of the variables. These nonlinear programming...
متن کاملA path-following infeasible interior-point algorithm for semidefinite programming
We present a new algorithm obtained by changing the search directions in the algorithm given in [8]. This algorithm is based on a new technique for finding the search direction and the strategy of the central path. At each iteration, we use only the full Nesterov-Todd (NT)step. Moreover, we obtain the currently best known iteration bound for the infeasible interior-point algorithms with full NT...
متن کاملA Trust Region Algorithm for Solving Nonlinear Equations (RESEARCH NOTE)
This paper presents a practical and efficient method to solve large-scale nonlinear equations. The global convergence of this new trust region algorithm is verified. The algorithm is then used to solve the nonlinear equations arising in an Expanded Lagrangian Function (ELF). Numerical results for the implementation of some large-scale problems indicate that the algorithm is efficient for these ...
متن کاملA Trust Region Interior Point Algorithm for Linearly Constrained Optimization
We present an extension, for nonlinear optimization under linear constraints, of an algorithm for quadratic programming using a trust region idea introduced by Ye and Tse [Math. Programming, 44 (1989), pp. 157–179] and extended by Bonnans and Bouhtou [RAIRO Rech. Opér., 29 (1995), pp. 195–217]. Due to the nonlinearity of the cost, we use a linesearch in order to reduce the step if necessary. We...
متن کاملA trust region method based on interior point techniques for nonlinear programming
An algorithm for minimizing a nonlinear function subject to nonlinear inequality constraints is described It applies sequential quadratic programming techniques to a sequence of barrier problems and uses trust regions to ensure the robustness of the iteration and to allow the direct use of second order derivatives This framework permits primal and primal dual steps but the paper focuses on the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Mathematics and Computing
سال: 2008
ISSN: 1598-5865,1865-2085
DOI: 10.1007/s12190-008-0051-6